Recursion rules for the hypergeometric zeta function
نویسندگان
چکیده
منابع مشابه
Recursion rules for the hypergeometric zeta function
The hypergeometric zeta function is defined in terms of the zeros of the Kummer function M(a, a+b; z). It is established that this function is an entire function of order 1. The classical factorization theorem of Hadamard gives an expression as an infinite product. This provides linear and quadratic recurrences for the hypergeometric zeta function. A family of associated polynomials is characte...
متن کاملRecursion Formulae for Hypergeometric Functions
indicates the term corresponding to j = h is to be deleted. If one of the a, = 0 or a negative integer, then (1) always converges, since it terminates. Otherwise it converges for all finite x if P ^ Q and for |a;| < 1 if P = Q + 1. In this case, however, the function can be analytically continued into the cut plane |arg (1 — a;)| < x, and we shall often denote by q+iFq(x) not only the series (1...
متن کاملHypergeometric Series Associated with the Hurwitz-lerch Zeta Function
The present work is a sequel to the papers [3] and [4], and it aims at introducing and investigating a new generalized double zeta function involving the Riemann, Hurwitz, Hurwitz-Lerch and Barnes double zeta functions as particular cases. We study its properties, integral representations, differential relations, series expansion and discuss the link with known results.
متن کاملHypergeometric Zeta Functions
This paper investigates a new family of special functions referred to as hypergeometric zeta functions. Derived from the integral representation of the classical Riemann zeta function, hypergeometric zeta functions exhibit many properties analogous to their classical counterpart, including the intimate connection to Bernoulli numbers. These new properties are treated in detail and are used to d...
متن کاملA New Algorithm for the Recursion of Hypergeometric Multisums
We introduce a new algorithm to find recursions of proper hypergeometric multisums. Our algorithm treats one summation variable at a time, and provides rational certificates along the way. We also provide an algorithm to construct a polynomial divisible by the denominator of any rational solution x(n) to am(n) bm(n) x(n + m) + · · · + a 0 (n) b 0 (n) x(n) = c(n) d(n) , where a i (n), b i (n), c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Number Theory
سال: 2014
ISSN: 1793-0421,1793-7310
DOI: 10.1142/s1793042114500547